Practice Test

Q1) This assignment problem is special case of _____ Show Answer

Q2) The assignment problem deals with allocating the various resources to various activities on ____ basis Show Answer

Q3) Which of the following is example of assignment problem Show Answer

Q4) For an assignment problem all supplies equal to____ Show Answer

Q5) In sequencing, an optimal path is one that
minimizes __________. Show Answer

Q6) If job A to D have processing times as 5, 6, 8, 4 on first machine and 4, 7, 9, 10 on second machine then the optimal sequence
is: Show Answer

Q7) The objective of sequencing problem is Show Answer

Q8) If there are n jobs and m machines, then there will be _________ sequences of doing the jobs. Show Answer

Q9) The Assignment Problem is solved by Show Answer

Q10) In solving 2 machine and n jobs sequencing problem, the following assumption is wrong Show Answer

Q11) To use the Hungarian method, a profit maximization assignment problem requires Show Answer

Q12) The assignment problem is said to be unbalance if Show Answer

Q13) The assignment problem is said to be balanced if Show Answer

Q14) The assignment problem is said to be balanced if it is a Show Answer

Q15) In an assignment problem if number of rows is greater than number of columns then Show Answer

Q16) In a 3 machine and 5 jobs problem, the least of processing times on machine A, B and C are 5, 1. and 3 hours and the highest processing times are 9, 5, and 7 respectively, then it can be converted to a 2 machine problem if order of the machines is: Show Answer

Q17) The objective of an assignment problem is to assign Show Answer

Q18) One machine - one job is not an assumption in solving sequencing problems. Show Answer

Q19) If there are two least processing times for machine A and machine B, priority is given for the processing time which has lowest time of the adjacent machine. Show Answer

Q20) To convert the assignment problem into a maximization problem, the smallest element in the matrix is deducted from all other elements. Show Answer

Q21) The Hungarian method operates on the principle of matrix reduction, whereby the cost table is reduced to a set of opportunity costs. Show Answer

Q22) In a sequencing problem, the processing times are dependent of order of processing the jobs on machines. Show Answer

Q23) Optimal assignments are made in the Hungarian method to cells in the reduced matrix that contain a zero. Show Answer

Q24) Using the Hungarian method, the optimal solution to an assignment problem is found when the minimum number of lines required to cover the zero cells in the reduced matrix equals the no of persons. Show Answer

Q25) In an assignment problem, if number of column is greater than number of rows, then a dummy column is added. Show Answer

Q26) The purpose of dummy row or column in an assignment problem is to obtain balance between total number of activities and total number of resources. Show Answer

Q27) One of the assumptions made while sequencing n jobs on 2 machines is two jobs must be loaded at a time on any machine. Show Answer

Q28) The optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of ________. Show Answer

Q29) Which solving an assignment problem an activity is assignment to a resource through a square with zero opportunity cast because the objective is to ________. Show Answer

Q30) The method used for solving an assignment problem is called _______. Show Answer

Q31) The purpose of the dummy row or column in as assignment problem is to _______. Show Answer

Q32) Maximization assignment problem is transformed into a minimization problem by ________. Show Answer

Q33) If there are n workers and n jobs there would be _________. Show Answer

Q34) An optimal solution of an assignment problem can be obtained only if ______. Show Answer

Q35) The condition for reducing a three machine problem into a two machine problem is ________. Show Answer

Q36) The time when a machine is available but is not being used as called _________. Show Answer

Q37) Which of the following is not a special case of assignment problem? Show Answer

Q38) In an unbalanced assignment problem which of the following is not true: Show Answer

Q39) Assignment algorithm was developed by _______. Show Answer

Q40) For an x n assignment problem there are _______ solutions. Show Answer

Q41) Which of the following is true for processing of n jobs through three machines? Show Answer

Q42) Which of the following is not assumption for a sequencing problem? Show Answer

Q43) Total elapsed time (T) can be computed by using formula _____. Show Answer

Q44) In an optimal sequencing algorithm, machine can process ________. Show Answer

Q45) Idle time for machine A is obtained by ________. Show Answer

Q46) Hungarian method used to assign jobs to machines is for ________. Show Answer

Q47) Which of the following constraints is not true for the assignment model? Show Answer

Q48) An assignment problem is said to be unbalanced when ________. Show Answer

Q49) When the number of rows is equal to the number of columns then the problem is said to be _________ assignment problem. Show Answer

Q50) For solving an assignment problem the matrix should be a ____________ matrix. Show Answer

Q51) If the given matrix is not a ________ matrix, the assignment problem is called an unbalanced problem. Show Answer

Q52) A dummy row (s) or column(s) with the cost elements as _________ the matrix of an unbalanced assignment problem as a square matrix. Show Answer

Q53) The time interval between starting the first job and completing the last. job including the idle time (if any) in a particular order by the given set of machines is called _______. Show Answer

Q54) The time for which a machine j does not have a job to process to the start of job it is called __________. Show Answer

Q55) Maximization assignment problem is transformed to minimization problem by subtracting each entry in the table from the _______ value in the table. Show Answer

Q56) When an assignment problem has more than one solution, then it is _________ optimal solution. Show Answer

Q57) The time required for printing off our books A, B, C and D is 5, 8, 10 and 7 hours. While its data entry requires 7, 4, 3 and 6 hrs. respectively. The sequence that minimizes total elapsed time is ________. Show Answer